A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems

An instance of the quadratic assignment problem (QAP) with cost matrix Q is said to be linearizable if there exists an instance of the linear assignment problem (LAP) with cost matrix C such that for each assignment, the QAP and LAP objective function values are identical. The QAP linearization problem can be solved in O(n) time. However, for the special cases of Koopmans-Beckmann QAP and the multiplicative assignment problem the input size is of O(n). We show that the QAP linearization problem for these special cases can be solved in O(n) time. For symmetric Koopmans-Beckmann QAP, Bookhold [4] gave a sufficient condition for linearizability and raised the question if the condition is necessary. We show that Bookhold’s condition is also necessary for linearizability of symmetric KoopmansBeckmann QAP.